TWO-DIMENSIONAL MINIMAL GRAPHS OVER UNBOUNDED DOMAINS
نویسندگان
چکیده
منابع مشابه
Area-minimizing Minimal Graphs over Nonconvex Domains
SuÆcient conditions for which a minimal graph over a nonconvex domain is area-minimizing are presented. The conditions are shown to hold for subsurfaces of Enneper's surface, the singly periodic Scherk surface, and the associated surfaces of the doubly periodic Scherk surface which previously were unknown to be area-minimizing. In particular these surfaces are graphs over (angularly accessible)...
متن کاملMinimal Graphs in R over Convex Domains
Krust established that all conjugate and associate surfaces of a minimal graph over a convex domain are also graphs. Using a convolution theorem from the theory of harmonic univalent mappings, we generalize Krust’s theorem to include the family of convolution surfaces which are generated by taking the Hadamard product or convolution of mappings. Since this convolution involves convex univalent ...
متن کاملOn two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
متن کاملAbduction over Unbounded Domains via ASP
It is known that abduction can be embedded into Answer Set programming (ASP). This enables sophisticated answer set solvers to be applied to abduction problems. However this approach does not scale to abduction over infinite domains, nor to unbounded abduction of individual existence, due to well-known undecidability results. The approaches to open abduction usually rely on 3-valued semantics t...
متن کاملInfinitely many minimal classes of graphs of unbounded clique-width
The celebrated theorem of Robertson and Seymour states that in the family of minor-closed graph classes, there is a unique minimal class of graphs of unbounded tree-width, namely, the class of planar graphs. In the case of tree-width, the restriction to minor-closed classes is justified by the fact that the tree-width of a graph is never smaller than the tree-width of any of its minors. This, h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Institute of Mathematics of Jussieu
سال: 2002
ISSN: 1474-7480,1475-3030
DOI: 10.1017/s1474748002000178